Modular Decomposition-Based Graph Compression for Fast Reachability Detection
نویسندگان
چکیده
منابع مشابه
Unifying Two Graph Decompositions with Modular Decomposition
We introduces the umodules, a generalisation of the notion of graph module. The theory we develop captures among others undirected graphs, tournaments, digraphs, and 2−structures. We show that, under some axioms, a unique decomposition tree exists for umodules. Polynomial-time algorithms are provided for: non-trivial umodule test, maximal umodule computation, and decomposition tree computation ...
متن کاملFast Dual Graph Based Hotspot Detection
As advanced technologies in wafer manufacturing push patterning processes toward lower-k1 subwavelength printing, lithography for mass production potentially suffers from decreased patterning fidelity. This results in generation of many hotspots, which are actual device patterns with relatively large CD and image errors with respect to on-wafer targets. Hotspots can be formed under a variety of...
متن کاملGraph Tree Decomposition Based Fast Peptide Sequencing and Spectral Alignment
De novo sequencing and spectral alignment are computationally important for the prediction of new peptides via tandem mass spectrometry (MS/MS). Both approaches are established upon the technique of finding the longest antisymmetric path on formulated graphs. The task is often complicated and the prediction accuracy is compromised when given spectra involve noise data, missing mass peaks, or po...
متن کاملFast Image Fractal Compression with Graph-Based Image Segmentation Algorithm
In this paper, the basic theory of image fractal compression is briefly introduced; some typical fractal compression approaches are discussed. Based on this discussion, according to the problem of long encoding time which exists in the typical fractal compression approaches, we propose a fast image fractal compression approach based on the combination of adaptive quad tree compression approach ...
متن کاملEfficient Graph Reachability Query Answering Using Tree Decomposition
Efficient reachability query answering in large directed graphs has been intensively investigated because of its fundamental importance in many application fields such as XML data processing, ontology reasoning and bioinformatics. In this paper, we present a novel indexing method based on the concept of tree decomposition. We show analytically that this intuitive approach is both time and space...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Data Science and Engineering
سال: 2019
ISSN: 2364-1185,2364-1541
DOI: 10.1007/s41019-019-00099-9